Constant-Round Authenticated Group Key Exchange for Dynamic Groups
نویسندگان
چکیده
An authenticated group key exchange (AGKE) scheme allows a group of users in a public network to share a session key which may later be used to achieve desirable cryptographic goals. In the paper, we study AGKE schemes for dynamically changing groups in ad hoc networks, i.e., for environments such that a member of a group may join and/or leave at any given time and a group key is exchanged without the help of any central sever. Difficulties in group key managements under such environments are caused by dynamically changing group and existence of no trustee. In most AGKE schemes proposed so far in the literature, the number of rounds is linear with respect to the number of group members. Such schemes are neither scalable nor practical since the number of group members may be quite large and the efficiency of the schemes is severely degraded with only one member’s delay. We propose an efficient provably secure AGKE scheme with constant-round. The propose scheme is still contributory and efficient, where each user executes three modular exponentiations and at most O(n) XOR operations. Keyword. dynamic authenticated group key exchange, ad hoc networks.
منابع مشابه
A secure and efficient password-authenticated group key exchange protocol for mobile ad hoc networks
Password-authenticated group key exchange protocols enable communication parties to establish a common secret key (a session key) by only using short secret passwords. Such protocols have been receiving significant attention. This paper shows some security weaknesses in some recently proposed passwordauthenticated group key exchange protocols. Furthermore, a secure and efficient password-authen...
متن کاملConstant Round Authenticated Group Key Agreement via Distributed Computation
A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require a linear number (with respect to the number of participants) of communication rounds to securely achieve this goal. In this paper we propose a new constant-round group key exchange protocol that provides e ciency and privacy un...
متن کاملPassword-Authenticated Constant-Round Group Key Establishment with a Common Reference String
A provably secure password-authenticated protocol for group key establishment in the common reference string (CRS) model is presented. Our construction assumes the participating users to share a common password and combines smooth hashing as introduced by Cramer and Shoup with a construction of Burmester and Desmedt. Our protocol is constant-round. Namely, it is a three-round protocol that can ...
متن کاملAn E cient Secure Authenticated Group Key Exchange Algorithm for Large and Dynamic Groups
We present a new secure authenticated group key exchange algorithm for large groups. The protocol scales e ciently and performs well for dynamic group operations such as join, leave, merge and sub-grouping. The algorithm converts any underlying two-party key exchange algorithm into an e cient group key exchange algorithm.
متن کاملAn Eecient Secure Authenticated Group Key Exchange Algorithm for Large and Dynamic Groups
We present a new secure authenticated group key exchange algorithm for large groups. The protocol scales e ciently and performs well for dynamic group operations such as join, leave, merge and sub-grouping. The algorithm converts any underlying two-party key exchange algorithm into an e cient group key exchange algorithm.
متن کامل